Improved Answer-Set Programming Encodings for Abstract Argumentation

The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks.Comment: To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 201

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

Peer reviewe

An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework

Peer reviewe

Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation

Peer reviewe

Declarative Algorithms and Complexity Results for Assumption-Based Argumentation

Peer reviewe

Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation

Peer reviewe

From Structured to Abstract Argumentation : Assumption-Based Acceptance via AF Reasoning

Peer reviewe

Computing Stable Conclusions under the Weakest-Link Principle in the ASPIC+ Argumentation Formalism

Peer reviewe

Synthesizing Argumentation Frameworks from Examples

Peer reviewe

Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings

Peer reviewe